tree stack automaton造句

例句与造句

1. A tree stack automaton is called " } }-restricted " for some positive natural number } } if, during any run of the automaton, any position of the tree stack is accessed at most times from below.
2. It's difficult to find tree stack automaton in a sentence. 用tree stack automaton造句挺难的